Balancing Cyclic R-ary Gray Codes
نویسندگان
چکیده
New cyclic n-digit Gray codes are constructed over {0, 1, . . . , R − 1} for all R,n ≥ 2. These codes have the property that the distribution of the digit changes (transition counts) is close to uniform: For every n ≥ 2, the number of occurrences of each digit in the n-digit codes is within R-1 of the average Rn/n, and for the 2-digit codes every transition count is either bR2/2c or dR2/2e.
منابع مشابه
Balancing Cyclic R-ary Gray Codes II
New cyclic n-digit Gray codes are constructed over {0, 1, . . . , R − 1} for all R ≥ 2, n ≥ 3. These codes have the property that the distribution of digit changes (transition counts) between two successive elements is close to uniform. For R = 2, the construction and proof are simpler than earlier balanced cyclic binary Gray codes. For R ≥ 3 and n ≥ 2, every transition count is within 2 of the...
متن کاملNew quantum codes from dual-containing cyclic codes over finite rings
Let R = F2m +uF2m + · · ·+u k F2m , where F2m is the finite field with 2 m elements, m is a positive integer, and u is an indeterminate with u = 0. In this paper, we propose the constructions of two new families of quantum codes obtained from dual-containing cyclic codes of odd length over R. A new Gray map over R is defined and a sufficient and necessary condition for the existence of dual-con...
متن کاملThe separability of standard cyclic N-ary Gray codes
A Sharp lower bound is derived for the cyclic list distance between two codewords, having Hamming distance , in the standard -ary Gray code of length , for 1 and for even values of . The bound generalizes a similar result in the binary case.
متن کاملCyclic codes over the ring $ \Z_p[u, v]/\langle u^2, v^2, uv-vu\rangle$
Let p be a prime number. In this paper, we study cyclic codes over the ring Z p [u, v]/u 2 , v 2 , uv − vu. We find a unique set of generators for these codes. We also study the rank and the Hamming distance of these codes. We obtain all except one ternary optimal code of length 12 as the Gray image of the cyclic codes over the ring Z p [u, v]/u 2 , v 2 , uv − vu. We also characterize the p-ary...
متن کاملCyclic codes over the ring $\mathbb{F}_p[u, v, w]/\langle u^2, v^2, w^2, uv-vu, vw-wv, uw-wu \rangle$
In this paper, we investigate cyclic codes over the ring Fp[u, v, w]〈u , v, w, uv− vu, vw − wv, uw − wu〉, where p is a prime number. Which is a part of family of Frobenius rings. We find a unique set of generators for these codes and characterize the free cyclic codes. We also study the rank and the Hamming distance of these codes. We also constructs some good p−ary codes as the Gray images of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 14 شماره
صفحات -
تاریخ انتشار 2007